An interior proximal point method with φ-divergence for Equilibrium Problems
نویسندگان
چکیده
In this paper, we consider the problem of general equilibrium in a finite-dimensional space on a closed convex set. For solving this problem, we developed an interior proximal point algorithm with φ-divergence. Under reasonable assumptions, we prove that the sequence generated by the algorithm converges to a solution of the Equilibrium Problem, when the regularization parameters are bounded.
منابع مشابه
A Hybrid Proximal Point Algorithm for Resolvent operator in Banach Spaces
Equilibrium problems have many uses in optimization theory and convex analysis and which is why different methods are presented for solving equilibrium problems in different spaces, such as Hilbert spaces and Banach spaces. The purpose of this paper is to provide a method for obtaining a solution to the equilibrium problem in Banach spaces. In fact, we consider a hybrid proximal point algorithm...
متن کاملEquivalence of Entropy Regularization and Relative-Entropy Proximal Method
We consider two entropy-based interior point methods that solve LP relaxations of MAP estimation in graphical models: (1) an entropy-regularization method and (2) a relative-entropy proximal method. Using the fact that relative-entropy is the Bregman distance induced by entropy, we show that the two approaches are actually equivalent. The purpose of this note is to show one connection between t...
متن کاملA Proximal Point Algorithm with φ-Divergence to Quasiconvex Programming
We use the proximal point method with the φ-divergence given by φ(t) = t− log t−1 for the minimization of quasiconvex functions subject to nonnegativity constraints. We establish that the sequence generated by our algorithm is well-defined in the sense that it exists and it is not cyclical. Without any assumption of boundedness level to the objective function, we obtain that the sequence conver...
متن کاملA generalized proximal point algorithm for the nonlinear complementarity problem
We consider a generalized proximal point method (GPPA) for solving the nonlinear complementarity problem with monotone operators in R ' \ lt differs from the classical proximal point method discussed by Rockafellar for the problem offinding zeroes of monotone operators in the use of generalized distances, called (p-divergences, instead of the Euclidean one. These distances play not only a regul...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013